Enumerating Planar Locally Finite Cayley Graphs
نویسندگان
چکیده
منابع مشابه
Enumerating planar locally finite Cayley graphs
We characterize the set of planar locally finite Cayley graphs, and give a finite representation of these graphs by a special kind of finite state automata called labeling schemes. As a result, we are able to enumerate and describe all planar locally finite Cayley graphs of a given degree. This analysis allows us to solve the problem of decision of the locally finite planarity for a word-proble...
متن کاملHamilton Cycles in Planar Locally Finite Graphs
A classical theorem by Tutte assures the existence of a Hamilton cycle in every finite 4-connected planar graph. Extensions of this result to infinite graphs require a suitable concept of an infinite cycle. Such a concept was provided by Diestel and Kühn, who defined circles to be homeomorphic images of the unit circle in the Freudenthal compactification of the (locally finite) graph. With this...
متن کاملOn locally primitive Cayley graphs of finite simple groups
A graph /is said to be G-locally primitive, where G is a subgroup of automorphisms of /-, if the stabiliser G~ of a vertex a acts primitively on the s e t / ( a ) of vertices of / adjacent to or. For a finite non-abelian simple group L and a Cayiey subset S of L, suppose that L <3 G...<Aut( L ) , and the Cayley graph /= Cay ( L, S) is G-locally primitive. In this paper we prove that L is a simp...
متن کاملEnumerating Planar Minimally Rigid Graphs
We present an algorithm for enumerating without repetitions all the planar (noncrossing) minimally rigid (Laman) graphs embedded on a given generic set of n points. Our algorithm is based on the Reverse search paradigm of Avis and Fukuda. It generates each output graph in O(n) time and O(n) space, or, with a slightly different implementation, in O(n) time and O(n) space. In particular, we obtai...
متن کاملThe planar cubic Cayley graphs
We obtain a complete description of the planar cubic Cayley graphs, providing an explicit presentation and embedding for each of them. This turns out to be a rich class, comprising several infinite families. We obtain counterexamples to conjectures of Mohar, Bonnington and Watkins. Our analysis makes the involved graphs accessible to computation, corroborating a conjecture of Droms. This thesis...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Geometriae Dedicata
سال: 2005
ISSN: 0046-5755,1572-9168
DOI: 10.1007/s10711-005-0548-1